Detecting squarefree numbers
نویسندگان
چکیده
We present an algorithm, based on the explicit formula for L-functions and conditional on GRH, for proving that a given integer is squarefree with little or no knowledge of its factorization. We analyze the algorithm both theoretically and practically, and use it to prove that several RSA challenge numbers are not squarefull.
منابع مشابه
-Catalan Numbers and Squarefree Binomial Coefficients
In this paper we consider the generalized Catalan numbers F (s, n) = 1 (s−1)n+1 ( sn n ) , which we call s-Catalan numbers. We find all natural numbers n such that for p prime, p divides F (p, n), q ≥ 1 and all distinct residues of F (p, n) (mod p), q = 1, 2. As a byproduct we settle a question of Hough and the late Simion on the divisibility of the 4-Catalan numbers by 4. We also prove that ( ...
متن کاملp-Catalan Numbers and Squarefree Binomial Coefficients
In this paper we consider the generalized Catalan numbers F (s, n) = 1 (s−1)n+1 ( sn n ) , which we call s-Catalan numbers. For p prime, we find all positive integers n such that p divides F (p, n), and also determine all distinct residues of F (p, n) (mod p), q ≥ 1. As a byproduct we settle a question of Hough and the late Simion on the divisibility of the 4-Catalan numbers by 4. In the second...
متن کاملShifting Operations and Graded Betti Numbers
The behaviour of graded Betti numbers under exterior and symmetric algebraic shifting is studied. It is shown that the extremal Betti numbers are stable under these operations. Moreover, the possible sequences of super extremal Betti numbers for a graded ideal with given Hilbert function are characterized. Finally it is shown that over a field of characteristic 0, the graded Betti numbers of a ...
متن کاملSquarefree Smooth Numbers and Euclidean Prime Generators
We show that for each prime p > 7, every residue mod p can be represented by a squarefree number with largest prime factor at most p. We give two applications to recursive prime generators akin to the one Euclid used to prove the infinitude of primes.
متن کاملBetti numbers of strongly color-stable ideals and squarefree strongly color-stable ideals
In this paper, we will show that the color-squarefree operation does not change the graded Betti numbers of strongly color-stable ideals. In addition, we will give an example of a nonpure balanced complex which shows that colored algebraic shifting, which was introduced by Babson and Novik, does not always preserve the dimension of reduced homology groups of balanced simplicial complexes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1304.6937 شماره
صفحات -
تاریخ انتشار 2013